ileanTAP: An Intuitionistic Theorem Prover
نویسنده
چکیده
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string unification to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the different logical connectives the implementation can easily be adapted to deal with other non-classical logics.
منابع مشابه
Ileantap: an Intuitionistic Theorem Prover Ileantap: an Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...
متن کاملA Sequent Based Theorem Prover for Propositional Intuitionistic Logic
We describe a theorem prover based on a new sequent calculus for Intuitionistic Propositional Logic. We discuss the effects of various optimisations, and analyse its performance compared to current state of the art theorem provers. We find that the prover produces competitive results on many classes of formulae.
متن کاملTeam Red: The Sandstorm Theorem Prover
We present the Sandstorm theorem prover, a forward-method focusing theorem prover for first-order intuitionistic logic.
متن کاملleanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)
leanCoP is a very compact theorem prover for classical firstorder logic, based on the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0 enhances leanCoP 1.0 by adding regularity, lemmata, and a technique for restricting backtracking. It also provides a definitional translation into clausal form and integrates “Prolog technology” into a lean theorem prover. ileanCoP is a compa...
متن کاملNon-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic
This paper introduces a non-clausal connection calculus for intuitionistic first-order logic. It is an extension of the non-clausal connection calculus for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic. nanoCoP-i is a first implementation of this intuitionistic non-clausal connection calculus. Details of the compact P...
متن کامل